Classification of nonorientable regular embeddings of complete bipartite graphs

نویسندگان

  • Jin Ho Kwak
  • Young Soo Kwon
چکیده

A 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags mutually incident vertex-edge-face triples. In this paper, we classify the regular embeddings of complete bipartite graphs Kn,n into nonorientable surfaces. Such a regular embedding of Kn,n exists only when n = 2p a1 1 p a2 2 · · · p ak k (a prime decomposition of n) and all pi ≡ ±1(mod 8). In this case, the number of those regular embeddings of Kn,n up to isomorphism is 2 k.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonorientable regular embeddings of graphs of order p2

In [J. Algeb. Combin. 19(2004), 123–141], Du et al. classified the orientable regular embeddings of connected simple graphs of order pq for any two primes p and q. In this paper, we shall classify the nonorientable regular embeddings of these graphs, where p 6= q. Our classification depends on the classification of primitive permutation groups of degree p and degree pq but is independent of the...

متن کامل

Triangular embeddings of complete graphs

In this paper we describe the generation of all nonorientable triangular embeddings of the complete graphs K12 and K13. (The 59 nonisomorphic orientable triangular embeddings of K12 were found in 1996 by Altshuler, Bokowski and Schuchert, and K13 has no orientable triangular embeddings.) There are 182, 200 nonisomorphic nonorientable triangular embeddings for K12, and 243, 088, 286 for K13. Tri...

متن کامل

Regular embeddings of complete bipartite graphs: classification and enumeration

The regular embeddings of complete bipartite graphs Kn,n in orientable surfaces are classified 5 and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in the cases where n is a prime power, obtained in collaboration with Du, Kwak, Nedela and Škoviera, together with results of Itô, Hall, Huppert and Wielandt on fa...

متن کامل

Bipartite graph embeddings, Riemann surfaces and Galois groups

Bipartite graphs can model matching problems, hypergraphs and relations between sets. Studying their surface embeddings is an old tradition, illustrated by the utilities problem. I shall show how such embeddings can be described by pairs of permutations, and how this leads to a classification of the regular (most symmetric) embeddings of complete bipartite graphs. This is joint work with Du, Kw...

متن کامل

Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 101  شماره 

صفحات  -

تاریخ انتشار 2011